Extended Feature Algebra

نویسندگان
چکیده

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Feature Algebra

Based on experience from the hardware industry, product families have entered the software development process as well, since software developers often prefer not to build a single product but rather a family of similar products that share at least one common functionality while having well-identified variabilities. Such shared commonalities, also called features, reach from common hardware par...

متن کامل

Extended Markovian Process Algebra

EMPA enhances the expressiveness of classical process algebras by integrating functional and performance descriptions of concurrent systems. This is achieved by ooering, besides passive actions (useful for pure nondeterminism), actions whose duration is exponentially distributed as well as immediate actions (useful for performance abstraction), parametrized by priority levels (hence prioritized...

متن کامل

MV-algebra extended

In this paper, we propose extensions of affine classical linear algebra(ACL-algebra) and many-valued algebra(MV-algebra), the emphasis is being on the latter. MV-algebras are algebraic models of à Lukasiewicz א0-valued logic(à Lא0) and that was established long back in 1958 by C.C. Chang. MV-algebra is recently studied from the angle of fuzzy set theory. Also it is investigated in connection wi...

متن کامل

Constraints in Feature Algebra

Feature Algebra captures the commonalities of feature oriented software development (FOSD), such as introductions, refinements and quantification. So far constraints have not been integrated into this algebraic framework. They arise in feature elicitation, feature dependence, feature exclusion, feature interaction etc. This paper presents a possibility for integrating such constraints into Feat...

متن کامل

An Extended Algebra for Constraint

| Constraint relational databases use constraints to both model and query data. A constraint relation contains a nite set of generalized tuples. Each generalized tuple is represented by a conjunction of constraints on a given logical theory and, depending on the logical theory and the speciic conjunction of constraints, it may possibly represent an in-nite set of relational tuples. For their ch...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Logical and Algebraic Methods in Programming

سال: 2016

ISSN: 2352-2208

DOI: 10.1016/j.jlamp.2015.12.002